A method of constructing the half-rate QC-LDPC codes with linear encoder, maximum column weight three and inevitable girth 26
نویسنده
چکیده
This paper presents a method of constructing the half-rate irregular quasi-cyclic low-density parity-check codes which can provide linear encoding algorithm and their H-matrices may contain almost the least “1” elements comparing with H-matrices of all existing LDPC codes. This method shows that three kinds of special structural matrices, respectively named as S-matrix, M-matrix and A-matrix, are defined and constructed. With regard to the arbitrary large structural girth based on A-matrix, its general pattern is conceived and its basic rule is proved. A general method of constructing M-matrix with the inevitable girth larger than 24 is introduced by using generalized block design and treating A-matrix as its sub-matrix. S-matrix is generated by substituting specially circular-shift values for non-zero elements in M-matrix. Combining H d -matrix generated from lifting the S-matrix and H p -matrix with the approximate lower triangular array structure forms the H-matrix, i.e. H=[H d H p ], which defines a class of half-rate irregular QC-LDPC codes with maximum column weight 3 and inevitable girth of length 26. Simulation tests show that the performance of the presented QC-LDPC code can achieve the signal-noise-ratio of below 2dB at the bit-error-rate of 10 -5 , which is comparable with the performance of the practical QC-LDPC codes in industrial Standard, but the complication of the former owing to the least “1” elements in H-matrix is lower than that of the later, as well as the storage requirement is smaller.
منابع مشابه
Large-Girth Column-Weight Two QC-LDPC Codes
This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance compar...
متن کاملConstructing High-Rate QC-LDPC Codes with Large-Girth based on Shortened Array Codes
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth10 based on shortened array codes. Our first contribution is the derivation of analytic results on the maximum number of columns for shortened array codes of different girths. Then, inspired by the analysis, we propose a code construction method for column-weight-three codes. We furth...
متن کاملColumn Weight Two and Three LDPC Codes with High Rates and Large Girths
In this paper, the concept of the broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. Interestingly, the constructed regular cycle codes with row-weights t, 3 ≤ t ≤ 20, t 6= 7, 15, 16, have the best lengths among the known regu...
متن کاملQuasi Cyclic LDPC Codes Based on Finite Set Systems
A finite set system (FSS) is a pair (V,B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a class of Quasi-cyclic lowdensity parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight d...
متن کاملConstruction of flexible type II and III QC-LDPC codes
Type II and III low-density parity-check codes (QC-LDPC) codes have been shown to have better minimum distance compared to Type I QC-LDPC codes. This article presents a highly flexible method for constructing high-girth type II and III QC-LDPC codes. The proposed algorithm establishes constraints to be observed in creating a bipartite graph of a given girth. The algorithm is by far more flexibl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015